Inference of Kronecker Structure

نویسنده

  • Myunghwan Kim
چکیده

A stochast Kronecker graph presents a generative model for the social and information networks. By means of EM algorithm with various version of MCMC samplings,we suggest a way to catch the potential Kronecker structure. This model allows us to infer how the latent part of graph is organized as well as to predict how the current graph evolves over time. General Terms Kronecker Graph

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Thoughts on Massively Scalable Gaussian Processes

We introduce a framework and early results for massively scalable Gaussian processes (MSGP), significantly extending the KISS-GP approach of Wilson and Nickisch (2015). The MSGP framework enables the use of Gaussian processes (GPs) on billions of datapoints, without requiring distributed inference, or severe assumptions. In particular, MSGP reduces the standard O(n) complexity of GP learning an...

متن کامل

Kronecker Product Linear Exponent AR(1) Correlation Structures for Multivariate Repeated Measures

Longitudinal imaging studies have moved to the forefront of medical research due to their ability to characterize spatio-temporal features of biological structures across the lifespan. Credible models of the correlations in longitudinal imaging require two or more pattern components. Valid inference requires enough flexibility of the correlation model to allow reasonable fidelity to the true pa...

متن کامل

Fast Kronecker Inference in Gaussian Processes with non-Gaussian Likelihoods

Gaussian processes (GPs) are a flexible class of methods with state of the art performance on spatial statistics applications. However, GPs require O(n) computations and O(n) storage, and popular GP kernels are typically limited to smoothing and interpolation. To address these difficulties, Kronecker methods have been used to exploit structure in the GP covariance matrix for scalability, while ...

متن کامل

Rigorous Analysis of Kronecker Graphs and their Algorithms

Real world graphs have been observed to display a number of surprising properties. These properties include heavy-tails for inand out-degree distributions, small diameters, and a densification law [5]. These features do not arise from the classical Erdos-Renyi random graph model [1]. To address these difficulties, Kronecker Graphs were first introduced in [5] as a new method of generating graph...

متن کامل

Bayesian approach to inference of population structure

Methods of inferring the population structure‎, ‎its applications in identifying disease models as well as foresighting the physical and mental situation of human beings have been finding ever-increasing importance‎. ‎In this article‎, ‎first‎, ‎motivation and significance of studying the problem of population structure is explained‎. ‎In the next section‎, ‎the applications of inference of p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009